Faster Batched Shortest Paths in Road Networks
نویسندگان
چکیده
We study the problem of computing batched shortest paths in road networks efficiently. Our focus is on computing paths from a single source to multiple targets (one-to-many queries). We perform a comprehensive experimental comparison of several approaches, including new ones. We conclude that a new extension of PHAST (a recent one-to-all algorithm), called RPHAST, has the best performance in most cases, often by orders of magnitude. When used to compute distance tables (many-to-many queries), RPHAST often outperforms all previous approaches. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap
Shortest path computation is a fundamental problem in road networks with various applications in research and industry. However, returning only the shortest path is often not satisfying. Users might also be interested in alternative paths that are slightly longer but have other desired properties, e.g., less frequent traffic congestion. In this paper, we study alternative routing and, in partic...
متن کاملAdvanced Route Planning in Transportation Networks
Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportation. For large networks, the classical Dijkstra algorithm to compute shortest paths is too slow. And therefore have faster algorithms been developed in ...
متن کاملRecursive Cut and Stitch: Fast All-Pairs Shortest Paths Computation for Subset of Nodes
We present a practical algorithm for computing all pairs shortest paths for subset of nodes on road networks. It provides an important improvement for applications such as traffic analysis, where recomputation of shortest paths is the most expensive step that has to be repeated many times. We propose an algorithm that recursively cuts the graph until pieces are small enough to compute shortest ...
متن کاملA Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorit...
متن کاملHierarchical Hub Labelings for Shortest Paths
We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed.
متن کامل